Incomplete Depth-first Search Techniques: a Short Survey
نویسنده
چکیده
Constraint Satisfaction Problem (CSP) is a discrete combinatorial problem and hence search algorithms belong to the main constraint satisfaction techniques. There exist local search techniques exploring complete but inconsistent assignments and depth-first search techniques extending partial consistent assignments towards complete assignments. For most problems it is impossible to explore complete search space so incomplete techniques are used. In this paper, we survey incomplete depth-first search techniques, in particular, generic incomplete search techniques and discrepancy-based search techniques.
منابع مشابه
Backtracking Search Algorithms
There are three main algorithmic techniques for solving constraint satisfaction problems: backtracking search, local search, and dynamic programming. In this chapter, I survey backtracking search algorithms. Algorithms based on dynamic programming [15]— sometimes referred to in the literature as variable elimination, synthesis, or inference algorithms—are the topic of Chapter 7. Local or stocha...
متن کاملSearch strategies for functional logic programming
In this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In particular, we show that complete strategies, like breadth-first search or iterative deepening search, are a viable alternative to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages.
متن کاملAbout the Completeness of Depth-First Proof-Number Search
Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its theoretical properties remain poorly understood. This paper resolves the question of completeness of df-pn: its ability to solve any finite boolean-valued game tree search problem in principle, given unlimited amounts of time an...
متن کاملBacktracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows (i.e. earliest/latest possible start time windows). This problem is a well-known NP-complete Constraint Satisfaction Problem (CSP). A popular method for solving this type of problems involves using depth-first backtrack search. In our earlier work, we f...
متن کاملRestricted Parallelism in Object-Oriented Lexical Parsing
We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation. A depth-first, yet incomplete parsing algorithm for a dependency grammar is specified and several restrictions on the degree of its parallelization are discussed.
متن کامل